Some Efficient Algorithms for Stochastic Equilibrium Assignment
نویسندگان
چکیده
منابع مشابه
Wardrop’s User Equilibrium Assignment under Stochastic Environment
Various models of traffic assignment under stochastic environment have been proposed recently, mainly by assuming different travelers’ behavior against uncertainties. This paper focuses on the expected residual minimization (ERM) model to provide a robust traffic assignment with an emphasis on the planner’s perspective. The model is further extended to obtain a stochastic prediction of the traf...
متن کاملEfficient Numerical Algorithms for Balanced Stochastic Truncation
We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determin...
متن کاملEfficient Stochastic Sampling Algorithms for Bayesian Networks
Graphical models are increasingly popular tools for modeling problems involving uncertainty. They deal with uncertainty by modeling and reasoning about degrees of uncertainty explicitly based on probability theory. Practical models based on graphical models often reach the size of hundreds of variables. Although a number of ingenious inference algorithms have been developed, the problem of exac...
متن کاملEfficient stochastic algorithms for document clustering
Clustering has become an increasingly important and highly complicated research area for targeting useful and relevant information in modern application domains such as the World Wide Web. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm may generate a local o...
متن کاملSome Prospects for Efficient Fixed Parameter Algorithms
Recent time has seen quite some progress in the development of exponential time algorithms for NP-hard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of xed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of eecient xed parameter algorithms, discuss deeciencies of param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFRASTRUCTURE PLANNING REVIEW
سال: 1990
ISSN: 0913-4034,1884-8303
DOI: 10.2208/journalip.8.89